Analysis of blocking probability for connection management schemes in optical networks
نویسندگان
چکیده
In this paper, we develop a model for evaluating the blocking probability of various connection management protocols for wavelengthrouted optical networks with dynamic lightpath establishment. The model characterizes both the blocking due to insufficient resources, as well as the blocking due to multiple interfering connection requests. We then use the analytical model to compare two connection management schemes, one which utilizes source-initiated reservation, and another which utilizes destination-initiated reservation.
منابع مشابه
A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملCentralized vs. distributed connection management schemes under different traffic patterns in wavelength-convertible optical networks
Centralized and Distributed methods are two connection management schemes in wavelength convertible optical networks. In the earlier work, the centralized scheme is said to have lower network blocking probability than the distributed one. Hence, much of the previous work in connection management has focused on the comparison of different algorithms in only distributed scheme or in only centrali...
متن کاملComputing approximate blocking probabilities for a class of all-optical networks - INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength o n that path. Moreover, o n the links of that path n o other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabil...
متن کاملAn efficient solution for management of pre-distribution in wireless sensor networks
A sensor node is composed of different parts including processing units, sensor, transmitter, receiver, and security unit. There are many nodes in a sensor unit. These networks can be used for military, industrial, medicine, environmental, house, and many other applications. These nodes may be established in the lands of enemies to monitor the relations. Hence, it is important to consider conse...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001